On simple combinatorial optimization problems
نویسندگان
چکیده
منابع مشابه
On Solving Combinatorial Optimization Problems
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...
متن کاملOn the Depth of Combinatorial Optimization Problems
This paper studies the notion of “depth” of a combinatorial optimization problem, which has already been touched on by several other authors (cf. Weber or Hajek). This notion can be defined as follows: Consider a discrete optimization problem min{r(.u) 1 x E x). Usually hill climbing algorithms work as follows: First, a neighbourhood structure has to be specified on X. Then, starting from an ar...
متن کاملCombinatorial Optimization Problems with Testing
In stochastic versions of combinatorial optimization problems, the goal is to optimize an objective function under constraints that specify the feasible solutions, when some parameters involve uncertainty. We focus on maximizing a linear objective ∑N i=1Wixi, where x1, . . . , xN are the decision variables, W1, . . . ,WN are mutually independent random coefficients, and the constraints are dete...
متن کاملInapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization problems.
متن کاملApproximating Incremental Combinatorial Optimization Problems
We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps. We consider a natural algorithm of moving towards a global optimum solution as quickly as possible. We show that this algorithm provides an approximation guarantee of (9 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90555-t